A Generalized Precompiling scheme for Surviving Path Memory Management in Viterbi decoders
نویسندگان
چکیده
The management of the surviving path memory in Viterbi's algorithm is generally performed by Trace-Back or Exchange.Register. A generalized method using precompiled trace-backs is presented. Resolution by a graphical method is proposed and three examples are solved.
منابع مشابه
Path metric memory management for minimising interconnections in Viterbi decoders - Electronics Letters
Linear equaliser DFE which one ACS unit processes all the states serially, have been used [3]. AS mobile communications are changing to higher performance systems that extend the decode rates into the range of Mbit/s, it is necessary to design a fast Viterbi decoder using low power and area. One of the promising schemes to achieve this goal is to partition states into a number of groups and to ...
متن کاملBiCMOS Circuits for Analog Viterbi Decoders
Analog Viterbi decoders are finding widespread use in class-IV partial-response disk-drive applications. These analog realizations are often used because they are smaller and consume less power than their digital counterparts. However, class-IV signaling allows simplifications during Viterbi detection and thus existing analog decoders have limited applications. The purpose of this paper is to d...
متن کاملArchitectural tradeoffs for survivor sequence memory management in Viterbi decoders
In a Viterbi decoder, there are two known memory organization techniques for the storage of survivor sequences from which the decoded information sequence is retrieved, namely register exchange method and traceback method. This paper extends previously known traceback approaches describes two new traceback algorithms, and compares various traceback methods with each other. Memory size, latency ...
متن کاملSurvivor Sequence Memory Management in Viterbi Decoders
In a Viterbi Decoder, there are two known memory organization techniques for the storage of survivor sequences from which the decoded information sequence is retrieved. The register erchange method is the simplest conceptually but suffers from the disadvantage that every bit in the memory must be read and rewritten for each information bit decoded. The alternative is the traceback method where ...
متن کاملBridging Viterbi and posterior decoding: a generalized risk approach to hidden path inference based on hidden Markov models
Motivated by the unceasing interest in hidden Markov models (HMMs), this paper reexamines hidden path inference in these models, using primarily a risk-based framework. While the most common maximum a posteriori (MAP), or Viterbi, path estimator and the minimum error, or Posterior Decoder (PD) have long been around, other path estimators, or decoders, have been either only hinted at or applied ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993